A Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs
Authors
Abstract:
In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of municipality district 14 of Tehran is used to evaluate the performance of inventory service level in hub networks.
similar resources
A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...
full textA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
full textMaximal Benefit Location Problem for A Congested System
Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known prob...
full textCapacitated single allocation hub location problem - A bi-criteria approach
A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allo...
full textModeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)
The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...
full textA Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...
full textMy Resources
Journal title
volume 28 issue 7
pages 1049- 1058
publication date 2015-07-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023